Optimal Tracking of Distributed Heavy Hitters and Quantiles
نویسندگان
چکیده
منابع مشابه
Distributed Private Heavy Hitters
In this paper, we give efficient algorithms and lower bounds for solving the heavy hitters problem while preserving differential privacy in the fully distributed local model. In this model, there are n parties, each of which possesses a single element from a universe of size N . The heavy hitters problem is to find the identity of the most common element shared amongst the n parties. In the loc...
متن کاملDifferentially Private Continual Monitoring of Heavy Hitters from Distributed Streams
We consider applications scenarios where an untrusted aggregator wishes to continually monitor the heavy-hitters across a set of distributed streams. Since each stream can contain sensitive data, such as the purchase history of customers, we wish to guarantee the privacy of each stream, while allowing the untrusted aggregator to accurately detect the heavy hitters and their approximate frequenc...
متن کاملSpace-optimal Heavy Hitters with Strong Error Bounds Citation
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several proposed solutions to this problem can outperform their worst-case guarantees on real data. This leads to the question of whether some stronger bounds can be guaranteed. We answer this in the positive by showing that a class ...
متن کاملBlock Heavy Hitters
We study a natural generalization of the heavy hitters problem in the streaming context. We term this generalization block heavy hitters and define it as follows. We are to stream over a matrix A, and report all rows that are heavy, where a row is heavy if its `1-norm is at least φ fraction of the `1 norm of the entire matrix A. In comparison, in the standard heavy hitters problem, we are requi...
متن کاملPrivate Approximate Heavy Hitters
We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to nd the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using polynomial computation time, polylogarithmic communication, and constantly man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9584-4